Logic-Based Subsumption Architecture: Empirical Evaluation (Status Report)

نویسنده

  • Eyal Amir
چکیده

We describe an implementation of the Logicbased Subsumption Architecture (LSA) [Amir and Maynard-Reid, 1999], an AI architecture inspired by Brooks’ subsumption architecture but based on logic. In this architecture, layers of control are axiomatized in First-Order Logic (FOL) and independent theorem provers derive each layer’s goals given its inputs. Default assumptions in the lower layers implement subsumption by higher layers. These assumptions are nonmonotonically retracted when higher layers draw new conclusions. We describe four layers designed for the task of robot control and experiments that empirically show the feasibility of using fully expressive FOL theorem provers for robot control with our architecture.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic-Based Subsumption Architecture

We describe a logic-based AI architecture based on Brooks’ subsumption architecture. In this architecture, we axiomatize different layers of control in First-Order Logic (FOL) and use independent theorem provers to derive each layer’s outputs given its inputs. We implement the subsumption of lower layers by higher layers using circumscription to make assumptions in lower layers, and nonmonotoni...

متن کامل

Inference Graphs: Combining Natural Deduction and Subsumption Inference in a Concurrent Reasoner

There are very few reasoners which combine natural deduction and subsumption reasoning, and there are none which do so while supporting concurrency. Inference Graphs are a graph-based inference mechanism using an expressive first– order logic, capable of subsumption and natural deduction reasoning using concurrency. Evaluation of concurrency characteristics on a combination natural deduction an...

متن کامل

Towards Efficient Subsumption

We propose several methods for writing efficient subsumption procedures for non-unit clauses, tested in practice as parts incorporated into the Gandalf family of theorem provers. Versions of Gandalf exist for classical logic, first order intuitionistic logic and type theory. Subsumption is one of the most important techniques for cutting down search space in resolution theorem proving. However,...

متن کامل

Empirical Investigation of Subsumption Test Hardness in Description Logic Classification

Recently, modular techniques have been employed for optimising Description Logic reasoning, specifically to enable incremental reasoning and improve overall classification time. Classifying a module of an ontology should be significantly easier than reasoning in the whole ontology. However, we observed in previous work that neither it is generally true that modular reasoning techniques have a r...

متن کامل

Subsumption-Free Bottom-up Evaluation of Logic Programs with Partially Instantiated Data Structures

Most deductive databases impose restrictions on the terms that can be used in them: they require that generated tuples be fully ground, i.e. contain no variables. Without this restriction, query evaluation of general programs needs subsumption tests in order to terminate correctly, and subsumption tests are expensive. We study a class of programs that can handle terms with both variables and fu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000